MIXED INTEGER-DISCRETE-CONTINUOUS OPTIMIZATION BY DIFFERENTIAL EVOLUTION Part 2: a practical example
نویسندگان
چکیده
This article discusses solving non-linear programming problems containing integer, discrete and continuous variables. The Part 1 of the article describes a novel optimization method based on Differential Evolution algorithm. The required handling techniques for integer, discrete and continuous variables are described including the techniques needed to handle boundary constraints as well as those needed to simultaneously deal with several non-linear and non-trivial constraint functions. In Part 2 of the article a mechanical engineering design related numerical example, design of a coil spring, is given to illustrate the capabilities and the practical use of the method. It is demonstrated that the described approach is capable of obtaining high quality solutions. The novel method is relatively easy to implement and use, effective, efficient and robust, which makes it as an attractive and widely applicable approach for solving practical engineering design problems.
منابع مشابه
MIXED INTEGER-DISCRETE-CONTINUOUS OPTIMIZATION BY DIFFERENTIAL EVOLUTION Part 1: the optimization method
This article discusses solving non-linear programming problems containing integer, discrete and continuous variables. The Part 1 of the article describes a novel optimization method based on Differential Evolution algorithm. The required handling techniques for integer, discrete and continuous variables are described including the techniques needed to handle boundary constraints as well as thos...
متن کاملMixed Variable Non-linear Optimization by Differential Evolution
This article discusses solving non-linear programming problems containing integer, discrete and continuous variables. A novel mixed integer-discrete-continuous, non-linear optimization method based on Differential Evolution algorithm is described. Also the required handling techniques for integer, discrete and continuous variables are described including the techniques needed to handle boundary...
متن کاملA novel technique for a class of singular boundary value problems
In this paper, Lagrange interpolation in Chebyshev-Gauss-Lobatto nodes is used to develop a procedure for finding discrete and continuous approximate solutions of a singular boundary value problem. At first, a continuous time optimization problem related to the original singular boundary value problem is proposed. Then, using the Chebyshev- Gauss-Lobatto nodes, we convert the continuous time op...
متن کاملGAMBIT: A Parameterless Model-Based Evolutionary Algorithm for Mixed-Integer Problems
Learning and exploiting problem structure is one of the key challenges in optimization. This is especially important for black-box optimization (BBO) where prior structural knowledge of a problem is not available. Existing model-based Evolutionary Algorithms (EAs) are very efficient at learning structure in both the discrete, and in the continuous domain. In this article, discrete and continuou...
متن کاملGlobal optimization of mixed-integer polynomial programming problems: A new method based on Grobner Bases theory
Mixed-integer polynomial programming (MIPP) problems are one class of mixed-integer nonlinear programming (MINLP) problems where objective function and constraints are restricted to the polynomial functions. Although the MINLP problem is NP-hard, in special cases such as MIPP problems, an efficient algorithm can be extended to solve it. In this research, we propose an algorit...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1999